Lebesgue Constant Minimizing Shape Preserving Barycentric Rational Interpolation Optimization algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lebesgue Constant Minimizing Bivariate Barycentric Rational Interpolation

The barycentric form is the most stable formula for a rational interpolant on a finite interval. The choice of the barycentric weights can ensure the absence of poles on the real line, so how to choose the optimal weights becomes a key question for bivariate barycentric rational interpolation. A new optimization algorithm is proposed for the best interpolation weights based on the Lebesgue cons...

متن کامل

On the Lebesgue constant of barycentric rational interpolation at equidistant nodes

Recent results reveal that the family of barycentric rational interpolants introduced by Floater and Hormann is very well-suited for the approximation of functions as well as their derivatives, integrals and primitives. Especially in the case of equidistant interpolation nodes, these infinitely smooth interpolants offer a much better choice than their polynomial analogue. A natural and importan...

متن کامل

Recent advances in linear barycentric rational interpolation

Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a trivial task, even in the univariate setting considered here; already the most important case, equispaced points, is not obvious. Certain approaches have nevertheless experienced significant developments in the last decades. In this paper we review one of them, linear barycentric rational interpolat...

متن کامل

Pyramid algorithms for barycentric rational interpolation

We present a new perspective on the Floater–Hormann interpolant. This interpolant is rational of degree (n, d), reproduces polynomials of degree d, and has no real poles. By casting the evaluation of this interpolant as a pyramid algorithm, we first demonstrate a close relation to Neville’s algorithm. We then derive an O(nd) algorithm for computing the barycentric weights of the Floater–Hormann...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Research Journal of Applied Sciences, Engineering and Technology

سال: 2013

ISSN: 2040-7459,2040-7467

DOI: 10.19026/rjaset.5.4460